Parallel algorithms for fractional and maximal independent sets in planar graphs
نویسندگان
چکیده
منابع مشابه
Parallel algorithms for the maximal independent set problem in graphs
In this paper we describe the randomized parallel algorithm proposed by Blelloch et al. [BFS12] to compute a Maximal Independent Set (MIS) of a given graph. We implemented their algorithm as well as the fastest sequential algorithm and compared their performance with different input graphs. Furthermore, we compared the number of rounds in both the sequential and parallel algorithms and present ...
متن کاملMaximal k-independent sets in graphs
A subset of vertices of a graph G is k-independent if it induces in G a subgraph of maximum degree less than k. The minimum and maximum cardinalities of a maximal k-independent set are respectively denoted ik(G) and βk(G). We give some relations between βk(G) and βj(G) and between ik(G) and ij(G) for j 6= k. We study two families of extremal graphs for the inequality i2(G) ≤ i(G) + β(G). Finall...
متن کاملArithmetically maximal independent sets in infinite graphs
Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.
متن کاملMaximal independent sets in caterpillar graphs
A caterpillar graph is a tree in which the removal of all pendant vertices results in a chordless path. In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P—complete. We provide a polynomial time algorithm to generate the whole family of mis in a caterpillar graph. We also characterize the independent graph (inter...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90130-5